import java.util.Scanner;
/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86185
 * Date: 2023-04-18
 * Time: 22:00
 */


class TreeNode {
    public char val;
    public TreeNode left;
    public TreeNode right;
    public TreeNode(char val) {
        this.val = val;
    }
}
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String str = in.nextLine();
        TreeNode root = createTree(str);
        inOrder(root);

    }
    public static int i = 0;

    /**
     * 二叉树的遍历
     * @param str
     * @return
     */
    public static TreeNode createTree(String str) {
        TreeNode root = null;
        char c = str.charAt(i);
        if(c != '#') {
            root = new TreeNode(c);
            i++;
            root.left = createTree(str);
            root.right = createTree(str);
        } else {
            i++;
        }
        return root;
    }
    public static void inOrder(TreeNode root) {
        if(root == null) {
            return;
        }
        inOrder(root.left);
        System.out.print(root.val + " ");
        inOrder(root.right);
    }
}